FairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings
نویسندگان
چکیده
Sequential recommendation (SR) learns from the temporal dynamics of user-item interactions to predict next ones. Fairness-aware mitigates a variety algorithmic biases in learning user preferences. This article aims at bringing marriage between SR and fairness. We propose novel fairness-aware sequential task, which new metric, interaction fairness , is defined estimate how recommended items are fairly interacted by users with different protected attribute groups. multi-task learning-based deep end-to-end model, FairSR, consists two parts. One learn distill personalized features given her item sequence for SR. The other preference graph embedding (FPGE). aim FPGE two-fold: incorporating knowledge users’ items’ attributes their correlation into entity representations, alleviating unfair distributions on items. Extensive experiments conducted three datasets show FairSR can outperform state-of-the-art models performance. In addition, also exhibit promising
منابع مشابه
Multi-task Preference learning with Gaussian Processes
We present an EM-algorithm for the problem of learning user preferences with Gaussian processes in the context of multi-task learning. We validate our approach on an audiological data set and show that predictive results for sound quality perception of normal hearing and hearingimpaired subjects, in the context of pairwise comparison experiments, can be improved using the hierarchical model.
متن کاملBalanced Neighborhoods for Fairness-aware Collaborative Recommendation
Recent work on fairness in machine learning has begun to be extended to recommender systems. While there is a tension between the goals of fairness and of personalization, there are contexts in which a global evaluations of outcomes is possible and where equity across such outcomes is a desirable goal. In this paper, we introduce the concept of a balanced neighborhood as a mechanism to preserve...
متن کاملGraph Embeddings for Movie Visualization and Recommendation
In this work we showcase how graph-embeddings can be used as a movie visualization and recommendation interface. The proposed low-dimensional embedding carefully preserves both local and global graph connectivity structure. The approach additionally offers: a) recommendations based on a pivot movie, b) interactive deep graph exploration of the movie connectivity graph, c) automatic movie traile...
متن کاملMulti-Task Learning for Sequential Data
The problem of multi-task learning (MTL) is considered for sequential data, such as that typically modeled via a hidden Markov model (HMM). A given task is composed of a set of sequential data, for which an HMM is to be learned, and MTL is employed to learn the multiple task-dependent HMMs jointly, through appropriate sharing of data. The HMM-MTL formulation is implemented in a Bayesian setting...
متن کاملSocial recommendation via multi-view user preference learning
Recommender system (RS) has become an active research area driven by the enormous industrial demands. Meanwhile, with the rapid development of microblogging system, various kinds of social data are available, which provide opportunities as well as challenges for traditional RSs. In this paper, we introduce the social recommendation (SR) problem utilizing microblogging data. We study this proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Intelligent Systems and Technology
سال: 2022
ISSN: ['2157-6904', '2157-6912']
DOI: https://doi.org/10.1145/3495163